CONSTRUCTION OF REVERSIBLE LATTICE MOLECULAR AUTOMATA
نویسندگان
چکیده
منابع مشابه
Construction of Reversible Lattice Molecular Automata
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction of a reversible lattice molecular automata (RLMA) model, which simulates molecular interaction and selforganization of higher-order structures. The model’s ...
متن کاملComputation and Construction Universality of Reversible Cellular Automata
An arbitrary d-dimensional cellular automaton can be constructively embedded in a reversible one having d + 1 dimensions. In particular, there exist computationand construction-universal reversible cellular automata. Thus, we explicitly show a way of implementing nontrivial irreversible processes in a reversible medium. Finally, we derive new results for the bounding problem for configurations,...
متن کاملOn the efficient construction of quasi-reversible automata for reversible languages
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language represented by its minimal DFA. Our method runs in polynomial time respect to the size of the minimal DFA and improves a previous exponential method. Previous bound for the size of quasi-reversible automata is also reduc...
متن کاملRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...
متن کاملLattice Automata
Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning about multi-valued objects, and describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2009
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183109014072